Iterated weak dominance and subgame dominance
نویسنده
چکیده
In this paper, we consider finite normal form games satisfying transference of decisionmaker indifference. We show that any set of strategies surviving k rounds of elimination of some weakly dominated strategies can be reduced to a set of strategies equivalent to the set of strategies surviving k rounds of elimination of all weakly dominated strategies in every round by (at most k) further rounds of elimination of weakly dominated strategies. The result develops work by Gretlein [Gretlein, R., 1983. Dominance elimination procedures on finite alternative games. International Journal of Game Theory 12, 107–113]. We then consider applications and demonstrate how we may obtain a unified approach to the work by Gretlein and recent results by Ewerhart [Ewerhart, C., 2002. Iterated weak dominance in strictly competitive games of perfect information. Journal of Economic Theory 107, 474-482] and Marx and Swinkels [Marx, L.M., Swinkels, J.M., 1997. Order independence for iterated weak dominance. Games and Economic Behavior 18, 219-245]. © 2004 Elsevier B.V. All rights reserved. JEL classification: C72
منابع مشابه
Order Independence for Iterated Weak Dominance
In general, the result of the elimination of weakly dominated strategies depends on order. We define nice weak dominance. Under nice weak dominance, order does not matter. We identify an important class of games under which nice weak dominance and weak dominance are equivalent, and so the order under weak dominance does not matter. For all games, the result of iterative nice weak dominance is a...
متن کاملAdaptive Learning and Iterated Weak Dominance
This article addresses the idea that rational players should not play iteratively weakly dominated strategies by showing that when a particular type of adaptive learning process converges, then players must have learned to play strategy profiles equivalent to those that survive iterated nice weak dominance and, for certain games, equivalent to those that survive iterated weak dominance. For gam...
متن کاملComplexity of Iterated Dominance and a New Definition of Eliminability
While the Nash equilibrium solution concept is studied more and more intensely in our community, the perhaps more elementary concept of iterated dominance has received much less attention. This paper makes two main contributions. First, we prove some basic complexity results about iterated dominance. We show that determining whether there is some path that eliminates a given strategy is NP-comp...
متن کاملOn Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems arising from the iterated removal of weakly dominated actions in anonymous games. Our main result shows that it is NP-complete to decide whether an anonymous game with three actions can be solved via iterated weak dominance. The two-action case can be reformulated as a natural elimination problem on a matrix, the complexity of which turns out to be surprisingly d...
متن کاملIterated Weaker-than-Weak Dominance
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter, δ. We can ...
متن کامل